A bisection algorithm for the numerical Mountain Pass

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

A Mountain Pass for Reacting Molecules

In this paper, we consider a neutral molecule that possesses two distinct stable positions for its nuclei, and look for a mountain pass point between the two minima in the non-relativistic Schrödinger framework. We first prove some properties concerning the spectrum and the eigenstates of a molecule that splits into pieces, a behaviour which is observed when the Palais-Smale sequences obtained ...

متن کامل

The intrinsic mountain pass principle

{ In this note we present a general mountain pass principle dropping any smoothness or even continuity assumptions on the functional. As a corollary, we prove existence of a point with an arbitrarily xed small slope if the "low" part of the "barrier" is suuciently far from the "boundary", obtaining in addition estimates for the location of the point.

متن کامل

ar X iv : m at h / 04 10 28 4 v 1 [ m at h . C A ] 1 2 O ct 2 00 4 A bisection algorithm for the numerical Mountain Pass

We propose a constructive proof for the Ambrosetti-Rabinowitz Mountain Pass Theorem providing an algorithm, based on a bisection method, for its implementation. The efficiency of our algorithm, particularly suitable for problems in high dimensions, consists in the low number of flow lines to be computed for its convergence; for this reason it improves the one currently used and proposed by Y.S....

متن کامل

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Differential Equations and Applications NoDEA

سال: 2007

ISSN: 1021-9722,1420-9004

DOI: 10.1007/s00030-007-4065-9